Convergence of multistep discretizations of DAEs

Standard ODE methods such as linear multistep methods encounter difficulties when applied to differential-algebraic equations (DAEs) of index greater than 1. In particular, previous results for index 2 DAEs have practically ruled out the use of all explicit methods and of implicit multistep methods other than backward difference formulas (BDFs) because of stability considerations. In this paper we embed known results for semi-explicit index 1 and 2 DAEs in a more comprehensive theory based on compound multistep and one-leg discretizations. This explains and characterizes the necessary requirements that a method must fulfill in order to be applicable to semi-explicit DAEs. Thus we conclude that the most useful discretizations are those that avoid discretization of the constraint. A freer use of e.g. explicit methods for the non-stiff differential part of the DAE is then possible.Dedicated to Germund Dahlquist on the occasion of his 70th birthdayThis author thanks the Centro de Estadística y Software Matemático de la Universidad Simón Bolivar (CESMa) for permitting her free use of its research facilities.Partial support by the Swedish Research Council for Engineering Sciences TFR under contract no. 222/91-405.     

Lyapunov-type inequalities for nonlinear systems

In this paper, by using elementary analysis, we establish some new Lyapunov-type inequalities for nonlinear systems of differential equations, special cases of which contain the well-known equations such as Emden-Fowler-type and half-linear equations. The inequalities obtained here can be used as handy tools in the study of qualitative behaviour of solutions of the associated equations.     

Existence and boundary behavior for singular nonlinear differential equations with arbitrary boundary conditions

Existence theory is developed for the equation ?(u)=F(u), where ? is a formally self-adjoint singular second-order differential expression and F is nonlinear. The problem is treated in a Hilbert space and we do not require the operators induced by ? to have completely continuous resolvents. Nonlinear boundary conditions are allowed. Also, F is assumed to be weakly continuous and monotone at one point. Boundary behavior of functions associated with the domains of definitions of the operators associated with ? in the singular case is investigated. A special class of self-adjoint operators associated with ? is obtained.     

An inverse spectral problem for a nonsymmetric differential operator: Reconstruction of eigenvalue problem

In this paper, an algorithm is established to reconstruct an eigenvalue problem from the given data satisfying certain conditions. These conditions are proved to be not only necessary but also sufficient for the given data to coincide with the spectral characteristics corresponding to the reconstructed eigenvalue problem.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Temperature‐modulated differential scanning calorimetry studies on the origin of double melting peaks in isothermally melt‐crystallized poly(L‐lactic acid)

In this work, the melting behaviors of nonisothermally and isothermally melt‐crystallized poly(L ‐lactic acid) (PLLA) from the melt were investigated with differential scanning calorimetry (DSC) and temperature‐modulated differential scanning calorimetry (TMDSC). The isothermal melt crystallizations of PLLA at a temperature in the range of 100–110 °C for 120 min or at 110 °C for a time in the range of 10–180 min appeared to exhibit double melting peaks in the DSC heating curves of 10 °C/min. TMDSC analysis revealed that the melting–recrystallization mechanism dominated the formation of the double melting peaks in PLLA samples following melt crystallizations at 110 °C for a shorter time (≤30 min) or at a lower temperature (100, 103, or 105 °C) for 120 min, whereas the double lamellar thickness model dominated the formation of the double melting peaks in those PLLA samples crystallized at a higher temperature (108 or 110 °C) for 120 min or at 110 °C for a longer time (≥45 min). © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 466–474, 2007     

高阶线性微分方程的解及其解的导数的不动点

研究了复域齐次和非齐次线性微分方程的解及其解的导数的不动点与超级问题,得到了整函数系数的齐次和非齐次线性微分方程的解及其解的导数的不动点的两个结果,所得结果推广了一些相关结果.     

FORWARD-BACKWARD STOCHASTIC DIFFERENTIAL EQUATIONS WITH STOPPING TIME

The existence and uniqueness results of fully coupled forward-backward stochastic differential equations with stopping time (unbounded) is obtained. One kind of comparison theorem for this kind of equations is also proved.     

Cauchy problem in the class of monotone increasing functions

The paper establishes some solvability conditions of the Cauchy problem for linear differential equation in the class of monotone increasing functions. The results are applied for clarifying the possibility of flight along a given trajectory under existence of braking forces.     

强色指数的一个新的上界

给出了图的强色指数的一个新的上界，并指出几类恰好达到该上界的图，从而改进了Erodoes和Nesetri的强色指数猜想，在某种意义上证明了这个猜想。